//
//  958. 二叉树的完全行检验.swift
//  LeetCodeTrain
//
//  Created by rjb on 2021/9/15.
//  Copyright © 2021 rjb. All rights reserved.
//

import Foundation

class Solution958 {
    // 判定一个颗二叉树是否是完全二叉树
    // 
    func isCompleteTree(_ root: TreeNode?) -> Bool {
        
        return true
    }
    static func test() {
        let solution = Solution958()
        
        let node1 = TreeNode(1)
        let node2 = TreeNode(2)
        let node3 = TreeNode(3)
        let node4 = TreeNode(4)
        let node5 = TreeNode(5)
        let node6 = TreeNode(6)
        
        node1.left = node2
        node1.right = node3
        
        node2.left = node4
        node2.right = node5
        
        node3.left = node6
        
        let result = solution.isCompleteTree(node1)
        print(result)
    }
}
